منابع مشابه
Tight Pounds on Oblivious Chaining
The chaining problem is deened as follows. = maxfj j a j = 1; j < ig. (Deene maxfg = 0) The chaining problem appears as a subproblem in many contexts. There are algorithms known that solve the chaining problem on CRCW PRAMs in O((n)) time, where (n) is the inverse of Ackerman's function, and is a very slowly growing function. We study a class of algorithms (called oblivious algorithms) for this...
متن کاملDecompressive laparotomy for abdominal compartment syndrome
BACKGROUND The effect of decompressive laparotomy on outcomes in patients with abdominal compartment syndrome has been poorly investigated. The aim of this prospective cohort study was to describe the effect of decompressive laparotomy for abdominal compartment syndrome on organ function and outcomes. METHODS This was a prospective cohort study in adult patients who underwent decompressive la...
متن کاملLaparoscopic colectomy: indications for conversion to laparotomy.
HYPOTHESIS Although experience with laparoscopic colectomy continues to accumulate, criteria for patient selection for the procedure have yet to be developed. We propose that review of indications for conversion to laparotomy during laparoscopic colectomy should define some of the current technical limitations of the procedure. This information may facilitate development of selection criteria f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 1989
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.299.6715.1566-a